Concurrency testing using symbolic path finder

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contessa: Concurrency Testing Augmented with Symbolic Analysis

Testing of multi-threaded programs poses enormous challenges. To improve the coverage of testing, we present a framework named CONTESSA that augments conventional testing (concrete execution) with symbolic analysis in a scalable and efficient manner to explore both thread interleaving and input data space. It is built on partial-order reduction techniques that generate verification conditions w...

متن کامل

Path Finder Strategy Radar

PurposeThe purpose of this research is to define and craft a “Path Finder Strategy” that can be adopted by firms, while entering into different markets with differentiated products. This conceptual yet a research paper covers an in-depth knowledge relating to devising a strategic ‘radar zone’ and assist in ascertaining whether a firm is product driven, market driven or customer driven (type of ...

متن کامل

Path finder mobile robot pdf

With the success of Mars Pathfinders Sojourner rover, a new era of planetary exploration has opened, with demand for highly capable mobile robots.mobile communication device is a small robot, originally constructed to allow. Up to now a lot of robots like the NASA Pathfinder were built to fulfil dedicated.Path Finding Mobile Robotics. Laser Range Finder.

متن کامل

Testing Database Programs using Relational Symbolic Execution

Symbolic execution is a technique which allows to automatically generate test inputs (and outputs) exercising a set of execution paths within a program to be tested. If the paths cover a sufficient part of the code under test, the test data offer a representative view of the program’s actual behaviour, allowing to detect failures and correct faults. Relational databases are ubiquitous in softwa...

متن کامل

Testing Database Transaction Concurrency

Database application programs are often designed to be executed concurrently by many clients. By grouping related database queries into transactions, DBMS systems can guarantee that each transaction satisfies the well-known ACID properties: Atomicity, Consistency, Isolation, and Durability. However, if a database application is decomposed into transactions in an incorrect manner, the applicatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Engineering & Technology

سال: 2018

ISSN: 2227-524X

DOI: 10.14419/ijet.v7i2.6.10782